<!-- This comment will put IE 6, 7 and 8 in quirks mode -->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>shark::LCTree&lt; VectorType, CuttingAccuracy &gt; Class Template Reference</title>
<script type="text/javaScript" src="search/search.js"></script>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<script src="https://polyfill.io/v3/polyfill.min.js?features=es6"></script>
<script id="MathJax-script" async src="https://cdn.jsdelivr.net/npm/mathjax@3.0.1/es5/tex-mml-chtml.js"></script>
<script src="../../mlstyle.js"></script>
<link href="../css/besser.css" rel="stylesheet" type="text/css"/>
</head>
<!-- pretty cool: each body gets an id tag which is the basename of the web page  -->
<!--              and allows for page-specific CSS. this is client-side scripted, -->
<!--              so the id will not yet show up in the served source code -->
<script type="text/javascript">
    jQuery(document).ready(function () {
        var url = jQuery(location).attr('href');
        var pname = url.substr(url.lastIndexOf("/")+1, url.lastIndexOf(".")-url.lastIndexOf("/")-1);
        jQuery('#this_url').html('<strong>' + pname + '</strong>');
        jQuery('body').attr('id', pname);
    });
</script>
<body>
    <div id="shark_old">
        <div id="wrap">
            <div id="header">
                <div id="site-name"><a href="../../sphinx_pages/build/html/index.html">Shark machine learning library</a></div>
                <ul id="nav">
                    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/installation.html">Installation</a>
                    </li>
		    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/tutorials/tutorials.html">Tutorials</a>
                    </li>
		    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/benchmark.html">Benchmarks</a>
                    </li>
                    <li class="active">
                        <a href="classes.html">Documentation</a>
                        <ul>
                            <li class="first"></li>
                            <li><a href="../../sphinx_pages/build/html/rest_sources/quickref/quickref.html">Quick references</a></li>
                            <li><a href="classes.html">Class list</a></li>
                            <li class="last"><a href="group__shark__globals.html">Global functions</a></li>
                        </ul>
                    </li>
                </ul>
            </div>
        </div>
    </div>
<div id="doxywrapper">
<!--
    <div id="global_doxytitle">Doxygen<br>Documentation:</div>
-->
    <div id="navrow_wrapper">
<!-- Generated by Doxygen 1.9.8 -->
<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="namespaceshark.html">shark</a></li><li class="navelem"><a class="el" href="classshark_1_1_l_c_tree.html">LCTree</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="summary">
<a href="classshark_1_1_l_c_tree-members.html">List of all members</a> &#124;
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pro-methods">Protected Member Functions</a> &#124;
<a href="#pro-attribs">Protected Attributes</a>  </div>
  <div class="headertitle"><div class="title">shark::LCTree&lt; VectorType, CuttingAccuracy &gt; Class Template Reference<div class="ingroups"><a class="el" href="group__models.html">Models</a> &raquo; <a class="el" href="group__space__trees.html">Space Partitioning Trees</a></div></div></div>
</div><!--header-->
<div class="contents">

<p>LC-tree, a binary space-partitioning tree.  
 <a href="classshark_1_1_l_c_tree.html#details">More...</a></p>

<p><code>#include &lt;<a class="el" href="_l_c_tree_8h_source.html">shark/Models/Trees/LCTree.h</a>&gt;</code></p>
<div id="dynsection-0" onclick="return toggleVisibility(this)" class="dynheader closed" style="cursor:pointer;">
  <img id="dynsection-0-trigger" src="closed.png" alt="+"/> Inheritance diagram for shark::LCTree&lt; VectorType, CuttingAccuracy &gt;:</div>
<div id="dynsection-0-summary" class="dynsummary" style="display:block;">
</div>
<div id="dynsection-0-content" class="dyncontent" style="display:none;">
<div class="center"><img src="classshark_1_1_l_c_tree__inherit__graph.png" border="0" usemap="#ashark_1_1_l_c_tree_3_01_vector_type_00_01_cutting_accuracy_01_4_inherit__map" alt="Inheritance graph"/></div>
<map name="ashark_1_1_l_c_tree_3_01_vector_type_00_01_cutting_accuracy_01_4_inherit__map" id="ashark_1_1_l_c_tree_3_01_vector_type_00_01_cutting_accuracy_01_4_inherit__map">
<area shape="rect" title="LC&#45;tree, a binary space&#45;partitioning tree." alt="" coords="5,94,192,135"/>
<area shape="rect" href="classshark_1_1_binary_tree.html" title="Super class of binary space&#45;partitioning trees." alt="" coords="32,5,165,46"/>
<area shape="poly" title=" " alt="" coords="101,62,101,94,96,94,96,62"/>
</map>
<center><span class="legend">[<a href="graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a2b66673868580ce17413f497f131e5df" id="r_a2b66673868580ce17413f497f131e5df"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_l_c_tree.html#a2b66673868580ce17413f497f131e5df">LCTree</a> (<a class="el" href="classshark_1_1_data.html">Data</a>&lt; RealVector &gt; const &amp;dataset, <a class="el" href="classshark_1_1_tree_construction.html">TreeConstruction</a> tc=<a class="el" href="classshark_1_1_tree_construction.html">TreeConstruction</a>())</td></tr>
<tr class="separator:a2b66673868580ce17413f497f131e5df"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ada804c1f1a75c767dc6c40960172254b" id="r_ada804c1f1a75c767dc6c40960172254b"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_l_c_tree.html#ada804c1f1a75c767dc6c40960172254b">squaredDistanceLowerBound</a> (<a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a> const &amp;reference) const</td></tr>
<tr class="separator:ada804c1f1a75c767dc6c40960172254b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="inherit_header pub_methods_classshark_1_1_binary_tree"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_classshark_1_1_binary_tree')"><img src="closed.png" alt="-"/>&#160;Public Member Functions inherited from <a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td></tr>
<tr class="memitem:a50b781f4203ea4d3a9e1dc60a52bec4e inherit pub_methods_classshark_1_1_binary_tree" id="r_a50b781f4203ea4d3a9e1dc60a52bec4e"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#a50b781f4203ea4d3a9e1dc60a52bec4e">BinaryTree</a> (std::size_t <a class="el" href="classshark_1_1_binary_tree.html#aa726e7311191b6617cf2079544e23662">size</a>)</td></tr>
<tr class="memdesc:a50b781f4203ea4d3a9e1dc60a52bec4e inherit pub_methods_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">Root node constructor: build the tree from data.  <br /></td></tr>
<tr class="separator:a50b781f4203ea4d3a9e1dc60a52bec4e inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9928e5dcb0026028ef3f4cbf56fe8721 inherit pub_methods_classshark_1_1_binary_tree" id="r_a9928e5dcb0026028ef3f4cbf56fe8721"><td class="memItemLeft" align="right" valign="top">virtual&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#a9928e5dcb0026028ef3f4cbf56fe8721">~BinaryTree</a> ()</td></tr>
<tr class="memdesc:a9928e5dcb0026028ef3f4cbf56fe8721 inherit pub_methods_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">Destroy the tree and its internal data structures.  <br /></td></tr>
<tr class="separator:a9928e5dcb0026028ef3f4cbf56fe8721 inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a86cc7ef0387f9ae7cb4aff75cf4c6bee inherit pub_methods_classshark_1_1_binary_tree" id="r_a86cc7ef0387f9ae7cb4aff75cf4c6bee"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#a86cc7ef0387f9ae7cb4aff75cf4c6bee">parent</a> ()</td></tr>
<tr class="memdesc:a86cc7ef0387f9ae7cb4aff75cf4c6bee inherit pub_methods_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">parent node  <br /></td></tr>
<tr class="separator:a86cc7ef0387f9ae7cb4aff75cf4c6bee inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acf31280508b15cf67be7b7b4d30e41f5 inherit pub_methods_classshark_1_1_binary_tree" id="r_acf31280508b15cf67be7b7b4d30e41f5"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#acf31280508b15cf67be7b7b4d30e41f5">parent</a> () const</td></tr>
<tr class="memdesc:acf31280508b15cf67be7b7b4d30e41f5 inherit pub_methods_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">parent node  <br /></td></tr>
<tr class="separator:acf31280508b15cf67be7b7b4d30e41f5 inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8d5379344624257a1c2950d4e64ab8c0 inherit pub_methods_classshark_1_1_binary_tree" id="r_a8d5379344624257a1c2950d4e64ab8c0"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#a8d5379344624257a1c2950d4e64ab8c0">hasChildren</a> () const</td></tr>
<tr class="separator:a8d5379344624257a1c2950d4e64ab8c0 inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1876569a27c34141bbc4e3fbfe2367ef inherit pub_methods_classshark_1_1_binary_tree" id="r_a1876569a27c34141bbc4e3fbfe2367ef"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#a1876569a27c34141bbc4e3fbfe2367ef">isLeaf</a> () const</td></tr>
<tr class="separator:a1876569a27c34141bbc4e3fbfe2367ef inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae20385cf5cf85d7168db9b3fcf411c47 inherit pub_methods_classshark_1_1_binary_tree" id="r_ae20385cf5cf85d7168db9b3fcf411c47"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#ae20385cf5cf85d7168db9b3fcf411c47">left</a> ()</td></tr>
<tr class="memdesc:ae20385cf5cf85d7168db9b3fcf411c47 inherit pub_methods_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">"left" sub-node of the binary tree  <br /></td></tr>
<tr class="separator:ae20385cf5cf85d7168db9b3fcf411c47 inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3b130767c5ff7c5233b0de89fb263221 inherit pub_methods_classshark_1_1_binary_tree" id="r_a3b130767c5ff7c5233b0de89fb263221"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#a3b130767c5ff7c5233b0de89fb263221">left</a> () const</td></tr>
<tr class="memdesc:a3b130767c5ff7c5233b0de89fb263221 inherit pub_methods_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">"left" sub-node of the binary tree  <br /></td></tr>
<tr class="separator:a3b130767c5ff7c5233b0de89fb263221 inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae5167564abb964d90da01897693a5768 inherit pub_methods_classshark_1_1_binary_tree" id="r_ae5167564abb964d90da01897693a5768"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#ae5167564abb964d90da01897693a5768">right</a> ()</td></tr>
<tr class="memdesc:ae5167564abb964d90da01897693a5768 inherit pub_methods_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">"right" sub-node of the binary tree  <br /></td></tr>
<tr class="separator:ae5167564abb964d90da01897693a5768 inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a57a5c5fd47bda6d5fc35774abfb9731f inherit pub_methods_classshark_1_1_binary_tree" id="r_a57a5c5fd47bda6d5fc35774abfb9731f"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#a57a5c5fd47bda6d5fc35774abfb9731f">right</a> () const</td></tr>
<tr class="memdesc:a57a5c5fd47bda6d5fc35774abfb9731f inherit pub_methods_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">"right" sub-node of the binary tree  <br /></td></tr>
<tr class="separator:a57a5c5fd47bda6d5fc35774abfb9731f inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa726e7311191b6617cf2079544e23662 inherit pub_methods_classshark_1_1_binary_tree" id="r_aa726e7311191b6617cf2079544e23662"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#aa726e7311191b6617cf2079544e23662">size</a> () const</td></tr>
<tr class="memdesc:aa726e7311191b6617cf2079544e23662 inherit pub_methods_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">number of points inside the space represented by this node  <br /></td></tr>
<tr class="separator:aa726e7311191b6617cf2079544e23662 inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a53cb65296bf84a1fbe0715e2ba0878bb inherit pub_methods_classshark_1_1_binary_tree" id="r_a53cb65296bf84a1fbe0715e2ba0878bb"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#a53cb65296bf84a1fbe0715e2ba0878bb">nodes</a> () const</td></tr>
<tr class="memdesc:a53cb65296bf84a1fbe0715e2ba0878bb inherit pub_methods_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">number of sub-nodes in this tree (including the node itself)  <br /></td></tr>
<tr class="separator:a53cb65296bf84a1fbe0715e2ba0878bb inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac499a09353aff38530837d22a16ad24a inherit pub_methods_classshark_1_1_binary_tree" id="r_ac499a09353aff38530837d22a16ad24a"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#ac499a09353aff38530837d22a16ad24a">index</a> (std::size_t point) const</td></tr>
<tr class="separator:ac499a09353aff38530837d22a16ad24a inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa0d859e272e40b522cb3eb328b0e1f41 inherit pub_methods_classshark_1_1_binary_tree" id="r_aa0d859e272e40b522cb3eb328b0e1f41"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#aa0d859e272e40b522cb3eb328b0e1f41">distanceFromPlane</a> (value_type const &amp;point) const</td></tr>
<tr class="memdesc:aa0d859e272e40b522cb3eb328b0e1f41 inherit pub_methods_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function describing the separation of space.  <br /></td></tr>
<tr class="separator:aa0d859e272e40b522cb3eb328b0e1f41 inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad7e43f9fa135d67d1817b2a7aa20b434 inherit pub_methods_classshark_1_1_binary_tree" id="r_ad7e43f9fa135d67d1817b2a7aa20b434"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#ad7e43f9fa135d67d1817b2a7aa20b434">threshold</a> () const</td></tr>
<tr class="memdesc:ad7e43f9fa135d67d1817b2a7aa20b434 inherit pub_methods_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">Separation threshold.  <br /></td></tr>
<tr class="separator:ad7e43f9fa135d67d1817b2a7aa20b434 inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a456c9994792021b1bb2557cad4ab7a3e inherit pub_methods_classshark_1_1_binary_tree" id="r_a456c9994792021b1bb2557cad4ab7a3e"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#a456c9994792021b1bb2557cad4ab7a3e">isLeft</a> (value_type const &amp;point) const</td></tr>
<tr class="separator:a456c9994792021b1bb2557cad4ab7a3e inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aaf824c0062811dfa4311a66292bb38be inherit pub_methods_classshark_1_1_binary_tree" id="r_aaf824c0062811dfa4311a66292bb38be"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#aaf824c0062811dfa4311a66292bb38be">isRight</a> (value_type const &amp;point) const</td></tr>
<tr class="separator:aaf824c0062811dfa4311a66292bb38be inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a882ac1aea537378fead318573c9b301c inherit pub_methods_classshark_1_1_binary_tree" id="r_a882ac1aea537378fead318573c9b301c"><td class="memItemLeft" align="right" valign="top">virtual <a class="el" href="classshark_1_1_abstract_kernel_function.html">AbstractKernelFunction</a>&lt; value_type &gt; const *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#a882ac1aea537378fead318573c9b301c">kernel</a> () const</td></tr>
<tr class="memdesc:a882ac1aea537378fead318573c9b301c inherit pub_methods_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">If the tree uses a kernel metric, returns a pointer to the kernel object, else NULL.  <br /></td></tr>
<tr class="separator:a882ac1aea537378fead318573c9b301c inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa78235225476effa7b22d285f3d9e197 inherit pub_methods_classshark_1_1_binary_tree" id="r_aa78235225476effa7b22d285f3d9e197"><td class="memItemLeft" align="right" valign="top">virtual double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#aa78235225476effa7b22d285f3d9e197">squaredDistanceLowerBound</a> (value_type const &amp;point) const =0</td></tr>
<tr class="memdesc:aa78235225476effa7b22d285f3d9e197 inherit pub_methods_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute lower bound on the squared distance to the space cell.  <br /></td></tr>
<tr class="separator:aa78235225476effa7b22d285f3d9e197 inherit pub_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pro-methods" name="pro-methods"></a>
Protected Member Functions</h2></td></tr>
<tr class="memitem:ae6e21af013959966a893cbb73bb8b534" id="r_ae6e21af013959966a893cbb73bb8b534"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_l_c_tree.html#ae6e21af013959966a893cbb73bb8b534">LCTree</a> (<a class="el" href="classshark_1_1_l_c_tree.html">LCTree</a> *<a class="el" href="classshark_1_1_binary_tree.html#a86cc7ef0387f9ae7cb4aff75cf4c6bee">parent</a>, std::size_t *list, std::size_t <a class="el" href="classshark_1_1_binary_tree.html#aa726e7311191b6617cf2079544e23662">size</a>)</td></tr>
<tr class="memdesc:ae6e21af013959966a893cbb73bb8b534"><td class="mdescLeft">&#160;</td><td class="mdescRight">(internal) construction of a non-root node  <br /></td></tr>
<tr class="separator:ae6e21af013959966a893cbb73bb8b534"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a24332e2c05b6a959b8f98577f83ab88a" id="r_a24332e2c05b6a959b8f98577f83ab88a"><td class="memTemplParams" colspan="2">template&lt;class Range &gt; </td></tr>
<tr class="memitem:a24332e2c05b6a959b8f98577f83ab88a"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classshark_1_1_l_c_tree.html#a24332e2c05b6a959b8f98577f83ab88a">buildTree</a> (<a class="el" href="classshark_1_1_tree_construction.html">TreeConstruction</a> tc, Range &amp;points)</td></tr>
<tr class="separator:a24332e2c05b6a959b8f98577f83ab88a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8041ad1217804997a45ccbc257b54f59" id="r_a8041ad1217804997a45ccbc257b54f59"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_l_c_tree.html#a8041ad1217804997a45ccbc257b54f59">funct</a> (<a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a> const &amp;reference) const</td></tr>
<tr class="memdesc:a8041ad1217804997a45ccbc257b54f59"><td class="mdescLeft">&#160;</td><td class="mdescRight">function describing the separating hyperplane  <br /></td></tr>
<tr class="separator:a8041ad1217804997a45ccbc257b54f59"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a254750fdf8053dfeead8442b783caba8" id="r_a254750fdf8053dfeead8442b783caba8"><td class="memTemplParams" colspan="2">template&lt;class Range &gt; </td></tr>
<tr class="memitem:a254750fdf8053dfeead8442b783caba8"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classshark_1_1_l_c_tree.html#a254750fdf8053dfeead8442b783caba8">calculateNormal</a> (Range const &amp;samples)</td></tr>
<tr class="separator:a254750fdf8053dfeead8442b783caba8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="inherit_header pro_methods_classshark_1_1_binary_tree"><td colspan="2" onclick="javascript:toggleInherit('pro_methods_classshark_1_1_binary_tree')"><img src="closed.png" alt="-"/>&#160;Protected Member Functions inherited from <a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td></tr>
<tr class="memitem:ac92e6cbbc2318f60cf32112bf640138e inherit pro_methods_classshark_1_1_binary_tree" id="r_ac92e6cbbc2318f60cf32112bf640138e"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#ac92e6cbbc2318f60cf32112bf640138e">BinaryTree</a> (<a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a> *<a class="el" href="classshark_1_1_binary_tree.html#a86cc7ef0387f9ae7cb4aff75cf4c6bee">parent</a>, std::size_t *list, std::size_t <a class="el" href="classshark_1_1_binary_tree.html#aa726e7311191b6617cf2079544e23662">size</a>)</td></tr>
<tr class="memdesc:ac92e6cbbc2318f60cf32112bf640138e inherit pro_methods_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sub-node constructor.  <br /></td></tr>
<tr class="separator:ac92e6cbbc2318f60cf32112bf640138e inherit pro_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad3bf9775a2e3122973a1b4036e8854fd inherit pro_methods_classshark_1_1_binary_tree" id="r_ad3bf9775a2e3122973a1b4036e8854fd"><td class="memItemLeft" align="right" valign="top">virtual double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#ad3bf9775a2e3122973a1b4036e8854fd">funct</a> (value_type const &amp;point) const =0</td></tr>
<tr class="memdesc:ad3bf9775a2e3122973a1b4036e8854fd inherit pro_methods_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function describing the separation of space.  <br /></td></tr>
<tr class="separator:ad3bf9775a2e3122973a1b4036e8854fd inherit pro_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a153a6ecae3dd8bf1407209962febca55 inherit pro_methods_classshark_1_1_binary_tree" id="r_a153a6ecae3dd8bf1407209962febca55"><td class="memTemplParams" colspan="2">template&lt;class Range1 , class Range2 &gt; </td></tr>
<tr class="memitem:a153a6ecae3dd8bf1407209962febca55 inherit pro_methods_classshark_1_1_binary_tree"><td class="memTemplItemLeft" align="right" valign="top">Range2::iterator&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#a153a6ecae3dd8bf1407209962febca55">splitList</a> (Range1 &amp;values, Range2 &amp;points)</td></tr>
<tr class="memdesc:a153a6ecae3dd8bf1407209962febca55 inherit pro_methods_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">Split the data in the point list and calculate the treshold accordingly.  <br /></td></tr>
<tr class="separator:a153a6ecae3dd8bf1407209962febca55 inherit pro_methods_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pro-attribs" name="pro-attribs"></a>
Protected Attributes</h2></td></tr>
<tr class="memitem:aa7b6ca703653d477e649edb0e2cf5fe7" id="r_aa7b6ca703653d477e649edb0e2cf5fe7"><td class="memItemLeft" align="right" valign="top"><a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_l_c_tree.html#aa7b6ca703653d477e649edb0e2cf5fe7">m_normal</a></td></tr>
<tr class="memdesc:aa7b6ca703653d477e649edb0e2cf5fe7"><td class="mdescLeft">&#160;</td><td class="mdescRight">split/cut normal vector of this node  <br /></td></tr>
<tr class="separator:aa7b6ca703653d477e649edb0e2cf5fe7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a100ef54d8a4904afff8c188bf4e735f9" id="r_a100ef54d8a4904afff8c188bf4e735f9"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_l_c_tree.html#a100ef54d8a4904afff8c188bf4e735f9">mep_parent</a></td></tr>
<tr class="memdesc:a100ef54d8a4904afff8c188bf4e735f9"><td class="mdescLeft">&#160;</td><td class="mdescRight">parent node  <br /></td></tr>
<tr class="separator:a100ef54d8a4904afff8c188bf4e735f9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a14c17e4fc65d1351cc23eceae05ce0d0" id="r_a14c17e4fc65d1351cc23eceae05ce0d0"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_l_c_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0">mp_left</a></td></tr>
<tr class="memdesc:a14c17e4fc65d1351cc23eceae05ce0d0"><td class="mdescLeft">&#160;</td><td class="mdescRight">"left" child node  <br /></td></tr>
<tr class="separator:a14c17e4fc65d1351cc23eceae05ce0d0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acc95bb731d3bfac4a896820f8de04ad8" id="r_acc95bb731d3bfac4a896820f8de04ad8"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_l_c_tree.html#acc95bb731d3bfac4a896820f8de04ad8">mp_right</a></td></tr>
<tr class="memdesc:acc95bb731d3bfac4a896820f8de04ad8"><td class="mdescLeft">&#160;</td><td class="mdescRight">"right" child node  <br /></td></tr>
<tr class="separator:acc95bb731d3bfac4a896820f8de04ad8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:afdce442d41868d9a84dcfc954c78ce93" id="r_afdce442d41868d9a84dcfc954c78ce93"><td class="memItemLeft" align="right" valign="top">std::size_t *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_l_c_tree.html#afdce442d41868d9a84dcfc954c78ce93">mp_indexList</a></td></tr>
<tr class="memdesc:afdce442d41868d9a84dcfc954c78ce93"><td class="mdescLeft">&#160;</td><td class="mdescRight">list of indices to points in the dataset  <br /></td></tr>
<tr class="separator:afdce442d41868d9a84dcfc954c78ce93"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a825e00e68228cb1654b5ac0a25f4972a" id="r_a825e00e68228cb1654b5ac0a25f4972a"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_l_c_tree.html#a825e00e68228cb1654b5ac0a25f4972a">m_size</a></td></tr>
<tr class="memdesc:a825e00e68228cb1654b5ac0a25f4972a"><td class="mdescLeft">&#160;</td><td class="mdescRight">number of points in this node  <br /></td></tr>
<tr class="separator:a825e00e68228cb1654b5ac0a25f4972a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad07d8f306001f8e1bc9a321a3d11444e" id="r_ad07d8f306001f8e1bc9a321a3d11444e"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_l_c_tree.html#ad07d8f306001f8e1bc9a321a3d11444e">m_nodes</a></td></tr>
<tr class="memdesc:ad07d8f306001f8e1bc9a321a3d11444e"><td class="mdescLeft">&#160;</td><td class="mdescRight">number of nodes in the sub-tree represented by this node  <br /></td></tr>
<tr class="separator:ad07d8f306001f8e1bc9a321a3d11444e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="inherit_header pro_attribs_classshark_1_1_binary_tree"><td colspan="2" onclick="javascript:toggleInherit('pro_attribs_classshark_1_1_binary_tree')"><img src="closed.png" alt="-"/>&#160;Protected Attributes inherited from <a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree&lt; InputT &gt;</a></td></tr>
<tr class="memitem:a100ef54d8a4904afff8c188bf4e735f9 inherit pro_attribs_classshark_1_1_binary_tree" id="r_a100ef54d8a4904afff8c188bf4e735f9"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#a100ef54d8a4904afff8c188bf4e735f9">mep_parent</a></td></tr>
<tr class="memdesc:a100ef54d8a4904afff8c188bf4e735f9 inherit pro_attribs_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">parent node  <br /></td></tr>
<tr class="separator:a100ef54d8a4904afff8c188bf4e735f9 inherit pro_attribs_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a14c17e4fc65d1351cc23eceae05ce0d0 inherit pro_attribs_classshark_1_1_binary_tree" id="r_a14c17e4fc65d1351cc23eceae05ce0d0"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0">mp_left</a></td></tr>
<tr class="memdesc:a14c17e4fc65d1351cc23eceae05ce0d0 inherit pro_attribs_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">"left" child node  <br /></td></tr>
<tr class="separator:a14c17e4fc65d1351cc23eceae05ce0d0 inherit pro_attribs_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acc95bb731d3bfac4a896820f8de04ad8 inherit pro_attribs_classshark_1_1_binary_tree" id="r_acc95bb731d3bfac4a896820f8de04ad8"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#acc95bb731d3bfac4a896820f8de04ad8">mp_right</a></td></tr>
<tr class="memdesc:acc95bb731d3bfac4a896820f8de04ad8 inherit pro_attribs_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">"right" child node  <br /></td></tr>
<tr class="separator:acc95bb731d3bfac4a896820f8de04ad8 inherit pro_attribs_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:afdce442d41868d9a84dcfc954c78ce93 inherit pro_attribs_classshark_1_1_binary_tree" id="r_afdce442d41868d9a84dcfc954c78ce93"><td class="memItemLeft" align="right" valign="top">std::size_t *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#afdce442d41868d9a84dcfc954c78ce93">mp_indexList</a></td></tr>
<tr class="memdesc:afdce442d41868d9a84dcfc954c78ce93 inherit pro_attribs_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">list of indices to points in the dataset  <br /></td></tr>
<tr class="separator:afdce442d41868d9a84dcfc954c78ce93 inherit pro_attribs_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a825e00e68228cb1654b5ac0a25f4972a inherit pro_attribs_classshark_1_1_binary_tree" id="r_a825e00e68228cb1654b5ac0a25f4972a"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#a825e00e68228cb1654b5ac0a25f4972a">m_size</a></td></tr>
<tr class="memdesc:a825e00e68228cb1654b5ac0a25f4972a inherit pro_attribs_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">number of points in this node  <br /></td></tr>
<tr class="separator:a825e00e68228cb1654b5ac0a25f4972a inherit pro_attribs_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad07d8f306001f8e1bc9a321a3d11444e inherit pro_attribs_classshark_1_1_binary_tree" id="r_ad07d8f306001f8e1bc9a321a3d11444e"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#ad07d8f306001f8e1bc9a321a3d11444e">m_nodes</a></td></tr>
<tr class="memdesc:ad07d8f306001f8e1bc9a321a3d11444e inherit pro_attribs_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">number of nodes in the sub-tree represented by this node  <br /></td></tr>
<tr class="separator:ad07d8f306001f8e1bc9a321a3d11444e inherit pro_attribs_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1d2b86563df35585acbbb0364d3a7450 inherit pro_attribs_classshark_1_1_binary_tree" id="r_a1d2b86563df35585acbbb0364d3a7450"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_binary_tree.html#a1d2b86563df35585acbbb0364d3a7450">m_threshold</a></td></tr>
<tr class="memdesc:a1d2b86563df35585acbbb0364d3a7450 inherit pro_attribs_classshark_1_1_binary_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">threshold for the separating function  <br /></td></tr>
<tr class="separator:a1d2b86563df35585acbbb0364d3a7450 inherit pro_attribs_classshark_1_1_binary_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><div class="compoundTemplParams">template&lt;class <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a> = RealVector, int CuttingAccuracy = 25&gt;<br />
class shark::LCTree&lt; VectorType, CuttingAccuracy &gt;</div><p>LC-tree, a binary space-partitioning tree. </p>
<dl class="section user"><dt></dt><dd>LC-tree data structure for efficient nearest neighbor searches in possibly high-dimensional spaces, but with low-dimensional effective data dimension (means &lt;&lt; 10 dimensions). "LC" stands for Linear Cut.</dd></dl>
<p>This tree requires the existence of a function inner_prod computing the standard inner product of two objects of type VectorType, and a function distanceSqr computing the squared Euclidean distance between two vectors.</p>
<dl class="section user"><dt></dt><dd>The tree is constructed from data by splitting the direction with largest extent (in the data covered, not space represented by the cell), recursively. Approximate direction and median are used to determine the cutting hyperplane, where the maximal number of points used to estimate the median can be controlled with the template parameter CuttingAccuracy.</dd></dl>
<dl class="section user"><dt></dt><dd>The bucket size for the tree is always one, such that there is a unique point in each leaf cell. </dd></dl>

<p class="definition">Definition at line <a class="el" href="_l_c_tree_8h_source.html#l00080">80</a> of file <a class="el" href="_l_c_tree_8h_source.html">LCTree.h</a>.</p>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="a2b66673868580ce17413f497f131e5df" name="a2b66673868580ce17413f497f131e5df"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2b66673868580ce17413f497f131e5df">&#9670;&#160;</a></span>LCTree() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>  = RealVector, int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classshark_1_1_l_c_tree.html">shark::LCTree</a>&lt; <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>, CuttingAccuracy &gt;::LCTree </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="classshark_1_1_data.html">Data</a>&lt; RealVector &gt; const &amp;&#160;</td>
          <td class="paramname"><em>dataset</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="classshark_1_1_tree_construction.html">TreeConstruction</a>&#160;</td>
          <td class="paramname"><em>tc</em> = <code><a class="el" href="classshark_1_1_tree_construction.html">TreeConstruction</a>()</code>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Construct the tree from data. It is assumed that the container exceeds the lifetime of the <a class="el" href="classshark_1_1_l_c_tree.html" title="LC-tree, a binary space-partitioning tree.">LCTree</a> (which holds only references to the points), and that the memory locations of the points remain unchanged. </p>

<p class="definition">Definition at line <a class="el" href="_l_c_tree_8h_source.html#l00090">90</a> of file <a class="el" href="_l_c_tree_8h_source.html">LCTree.h</a>.</p>

<p class="reference">References <a class="el" href="classshark_1_1_l_c_tree.html#a24332e2c05b6a959b8f98577f83ab88a">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::buildTree()</a>, <a class="el" href="classshark_1_1_l_c_tree.html#a825e00e68228cb1654b5ac0a25f4972a">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::m_size</a>, and <a class="el" href="classshark_1_1_l_c_tree.html#afdce442d41868d9a84dcfc954c78ce93">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::mp_indexList</a>.</p>

</div>
</div>
<a id="ae6e21af013959966a893cbb73bb8b534" name="ae6e21af013959966a893cbb73bb8b534"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae6e21af013959966a893cbb73bb8b534">&#9670;&#160;</a></span>LCTree() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>  = RealVector, int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classshark_1_1_l_c_tree.html">shark::LCTree</a>&lt; <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>, CuttingAccuracy &gt;::LCTree </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="classshark_1_1_l_c_tree.html">LCTree</a>&lt; <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>, CuttingAccuracy &gt; *&#160;</td>
          <td class="paramname"><em>parent</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">std::size_t *&#160;</td>
          <td class="paramname"><em>list</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">std::size_t&#160;</td>
          <td class="paramname"><em>size</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>(internal) construction of a non-root node </p>

<p class="definition">Definition at line <a class="el" href="_l_c_tree_8h_source.html#l00140">140</a> of file <a class="el" href="_l_c_tree_8h_source.html">LCTree.h</a>.</p>

</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="a24332e2c05b6a959b8f98577f83ab88a" name="a24332e2c05b6a959b8f98577f83ab88a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a24332e2c05b6a959b8f98577f83ab88a">&#9670;&#160;</a></span>buildTree()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>  = RealVector, int CuttingAccuracy = 25&gt; </div>
<div class="memtemplate">
template&lt;class Range &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="classshark_1_1_l_c_tree.html">shark::LCTree</a>&lt; <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>, CuttingAccuracy &gt;::buildTree </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="classshark_1_1_tree_construction.html">TreeConstruction</a>&#160;</td>
          <td class="paramname"><em>tc</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Range &amp;&#160;</td>
          <td class="paramname"><em>points</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>(internal) construction method: median-cuts of the dimension with widest spread </p>

<p class="definition">Definition at line <a class="el" href="_l_c_tree_8h_source.html#l00146">146</a> of file <a class="el" href="_l_c_tree_8h_source.html">LCTree.h</a>.</p>

<p class="reference">References <a class="el" href="classshark_1_1_l_c_tree.html#a254750fdf8053dfeead8442b783caba8">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::calculateNormal()</a>, <a class="el" href="classshark_1_1_binary_tree.html#ae20385cf5cf85d7168db9b3fcf411c47">shark::BinaryTree&lt; InputT &gt;::left()</a>, <a class="el" href="classshark_1_1_l_c_tree.html#ad07d8f306001f8e1bc9a321a3d11444e">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::m_nodes</a>, <a class="el" href="classshark_1_1_l_c_tree.html#aa7b6ca703653d477e649edb0e2cf5fe7">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::m_normal</a>, <a class="el" href="classshark_1_1_l_c_tree.html#a825e00e68228cb1654b5ac0a25f4972a">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::m_size</a>, <a class="el" href="classshark_1_1_tree_construction.html#aa1b255097aa1e7101783b1300b921aad">shark::TreeConstruction::maxBucketSize()</a>, <a class="el" href="classshark_1_1_tree_construction.html#abb2b42865b60ddf110e4915ab6457373">shark::TreeConstruction::maxDepth()</a>, <a class="el" href="classshark_1_1_l_c_tree.html#afdce442d41868d9a84dcfc954c78ce93">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::mp_indexList</a>, <a class="el" href="classshark_1_1_l_c_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::mp_left</a>, <a class="el" href="classshark_1_1_l_c_tree.html#acc95bb731d3bfac4a896820f8de04ad8">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::mp_right</a>, <a class="el" href="classshark_1_1_tree_construction.html#aa76f09fabb33889421b6c8f2771afb8a">shark::TreeConstruction::nextDepthLevel()</a>, <a class="el" href="classshark_1_1_binary_tree.html#a53cb65296bf84a1fbe0715e2ba0878bb">shark::BinaryTree&lt; InputT &gt;::nodes()</a>, <a class="el" href="classshark_1_1_binary_tree.html#ae5167564abb964d90da01897693a5768">shark::BinaryTree&lt; InputT &gt;::right()</a>, and <a class="el" href="classshark_1_1_binary_tree.html#a153a6ecae3dd8bf1407209962febca55">shark::BinaryTree&lt; InputT &gt;::splitList()</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_l_c_tree.html#a2b66673868580ce17413f497f131e5df">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::LCTree()</a>.</p>

</div>
</div>
<a id="a254750fdf8053dfeead8442b783caba8" name="a254750fdf8053dfeead8442b783caba8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a254750fdf8053dfeead8442b783caba8">&#9670;&#160;</a></span>calculateNormal()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>  = RealVector, int CuttingAccuracy = 25&gt; </div>
<div class="memtemplate">
template&lt;class Range &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="classshark_1_1_l_c_tree.html">shark::LCTree</a>&lt; <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>, CuttingAccuracy &gt;::calculateNormal </td>
          <td>(</td>
          <td class="paramtype">Range const &amp;&#160;</td>
          <td class="paramname"><em>samples</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">Definition at line <a class="el" href="_l_c_tree_8h_source.html#l00207">207</a> of file <a class="el" href="_l_c_tree_8h_source.html">LCTree.h</a>.</p>

<p class="reference">References <a class="el" href="classshark_1_1_l_c_tree.html#aa7b6ca703653d477e649edb0e2cf5fe7">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::m_normal</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_l_c_tree.html#a24332e2c05b6a959b8f98577f83ab88a">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::buildTree()</a>.</p>

</div>
</div>
<a id="a8041ad1217804997a45ccbc257b54f59" name="a8041ad1217804997a45ccbc257b54f59"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8041ad1217804997a45ccbc257b54f59">&#9670;&#160;</a></span>funct()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>  = RealVector, int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">double <a class="el" href="classshark_1_1_l_c_tree.html">shark::LCTree</a>&lt; <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>, CuttingAccuracy &gt;::funct </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a> const &amp;&#160;</td>
          <td class="paramname"><em>reference</em></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>function describing the separating hyperplane </p>

<p class="definition">Definition at line <a class="el" href="_l_c_tree_8h_source.html#l00200">200</a> of file <a class="el" href="_l_c_tree_8h_source.html">LCTree.h</a>.</p>

<p class="reference">References <a class="el" href="classshark_1_1_l_c_tree.html#aa7b6ca703653d477e649edb0e2cf5fe7">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::m_normal</a>.</p>

</div>
</div>
<a id="ada804c1f1a75c767dc6c40960172254b" name="ada804c1f1a75c767dc6c40960172254b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ada804c1f1a75c767dc6c40960172254b">&#9670;&#160;</a></span>squaredDistanceLowerBound()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>  = RealVector, int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">double <a class="el" href="classshark_1_1_l_c_tree.html">shark::LCTree</a>&lt; <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>, CuttingAccuracy &gt;::squaredDistanceLowerBound </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a> const &amp;&#160;</td>
          <td class="paramname"><em>reference</em></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<dl class="section user"><dt></dt><dd>Compute the squared Euclidean distance of this cell to the given reference point, or alternatively a lower bound on this value. </dd></dl>

<p class="definition">Definition at line <a class="el" href="_l_c_tree_8h_source.html#l00114">114</a> of file <a class="el" href="_l_c_tree_8h_source.html">LCTree.h</a>.</p>

<p class="reference">References <a class="el" href="classshark_1_1_binary_tree.html#aa0d859e272e40b522cb3eb328b0e1f41">shark::BinaryTree&lt; InputT &gt;::distanceFromPlane()</a>, <a class="el" href="classshark_1_1_l_c_tree.html#a100ef54d8a4904afff8c188bf4e735f9">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::mep_parent</a>, and <a class="el" href="classshark_1_1_l_c_tree.html#acc95bb731d3bfac4a896820f8de04ad8">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::mp_right</a>.</p>

</div>
</div>
<h2 class="groupheader">Member Data Documentation</h2>
<a id="ad07d8f306001f8e1bc9a321a3d11444e" name="ad07d8f306001f8e1bc9a321a3d11444e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad07d8f306001f8e1bc9a321a3d11444e">&#9670;&#160;</a></span>m_nodes</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>  = RealVector, int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">std::size_t <a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree</a>&lt; InputT &gt;::m_nodes</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>number of nodes in the sub-tree represented by this node </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00361">361</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_l_c_tree.html#a24332e2c05b6a959b8f98577f83ab88a">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::buildTree()</a>.</p>

</div>
</div>
<a id="aa7b6ca703653d477e649edb0e2cf5fe7" name="aa7b6ca703653d477e649edb0e2cf5fe7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa7b6ca703653d477e649edb0e2cf5fe7">&#9670;&#160;</a></span>m_normal</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>  = RealVector, int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a> <a class="el" href="classshark_1_1_l_c_tree.html">shark::LCTree</a>&lt; <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>, CuttingAccuracy &gt;::m_normal</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>split/cut normal vector of this node </p>

<p class="definition">Definition at line <a class="el" href="_l_c_tree_8h_source.html#l00230">230</a> of file <a class="el" href="_l_c_tree_8h_source.html">LCTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_l_c_tree.html#a24332e2c05b6a959b8f98577f83ab88a">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::buildTree()</a>, <a class="el" href="classshark_1_1_l_c_tree.html#a254750fdf8053dfeead8442b783caba8">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::calculateNormal()</a>, and <a class="el" href="classshark_1_1_l_c_tree.html#a8041ad1217804997a45ccbc257b54f59">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::funct()</a>.</p>

</div>
</div>
<a id="a825e00e68228cb1654b5ac0a25f4972a" name="a825e00e68228cb1654b5ac0a25f4972a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a825e00e68228cb1654b5ac0a25f4972a">&#9670;&#160;</a></span>m_size</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>  = RealVector, int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">std::size_t <a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree</a>&lt; InputT &gt;::m_size</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>number of points in this node </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00358">358</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_l_c_tree.html#a24332e2c05b6a959b8f98577f83ab88a">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::buildTree()</a>, and <a class="el" href="classshark_1_1_l_c_tree.html#a2b66673868580ce17413f497f131e5df">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::LCTree()</a>.</p>

</div>
</div>
<a id="a100ef54d8a4904afff8c188bf4e735f9" name="a100ef54d8a4904afff8c188bf4e735f9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a100ef54d8a4904afff8c188bf4e735f9">&#9670;&#160;</a></span>mep_parent</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>  = RealVector, int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a>* <a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree</a>&lt; InputT &gt;::mep_parent</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>parent node </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00346">346</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_l_c_tree.html#ada804c1f1a75c767dc6c40960172254b">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::squaredDistanceLowerBound()</a>.</p>

</div>
</div>
<a id="afdce442d41868d9a84dcfc954c78ce93" name="afdce442d41868d9a84dcfc954c78ce93"></a>
<h2 class="memtitle"><span class="permalink"><a href="#afdce442d41868d9a84dcfc954c78ce93">&#9670;&#160;</a></span>mp_indexList</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>  = RealVector, int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">std::size_t* <a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree</a>&lt; InputT &gt;::mp_indexList</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>list of indices to points in the dataset </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00355">355</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_l_c_tree.html#a24332e2c05b6a959b8f98577f83ab88a">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::buildTree()</a>, and <a class="el" href="classshark_1_1_l_c_tree.html#a2b66673868580ce17413f497f131e5df">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::LCTree()</a>.</p>

</div>
</div>
<a id="a14c17e4fc65d1351cc23eceae05ce0d0" name="a14c17e4fc65d1351cc23eceae05ce0d0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a14c17e4fc65d1351cc23eceae05ce0d0">&#9670;&#160;</a></span>mp_left</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>  = RealVector, int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a>* <a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree</a>&lt; InputT &gt;::mp_left</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>"left" child node </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00349">349</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_l_c_tree.html#a24332e2c05b6a959b8f98577f83ab88a">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::buildTree()</a>.</p>

</div>
</div>
<a id="acc95bb731d3bfac4a896820f8de04ad8" name="acc95bb731d3bfac4a896820f8de04ad8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acc95bb731d3bfac4a896820f8de04ad8">&#9670;&#160;</a></span>mp_right</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class <a class="el" href="_c_svm_linear_8cpp.html#ab106d665148183a2dc94dcf8716c9203">VectorType</a>  = RealVector, int CuttingAccuracy = 25&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classshark_1_1_binary_tree.html">BinaryTree</a>* <a class="el" href="classshark_1_1_binary_tree.html">shark::BinaryTree</a>&lt; InputT &gt;::mp_right</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>"right" child node </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00352">352</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_l_c_tree.html#a24332e2c05b6a959b8f98577f83ab88a">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::buildTree()</a>, and <a class="el" href="classshark_1_1_l_c_tree.html#ada804c1f1a75c767dc6c40960172254b">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::squaredDistanceLowerBound()</a>.</p>

</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>include/shark/Models/Trees/<a class="el" href="_l_c_tree_8h_source.html">LCTree.h</a></li>
</ul>
</div><!-- contents -->
</div>
</body>
</html>
